Graph comparison via the nonbacktracking spectrum
نویسندگان
چکیده
منابع مشابه
A graph associated to spectrum of a commutative ring
Let $R$ be a commutative ring. In this paper, by using algebraic properties of $R$, we study the Hase digraph of prime ideals of $R$.
متن کاملAn Effective Comparison of Graph Clustering Algorithms via Random Graphs
Many graph clustering algorithms have been proposed in recent past researches, each algorithm having its own advantages and drawbacks. All these algorithms rely on a very different approach so it’s really hard to say that which one is the most efficient and optimal if we talk in the sense of performance. It is really hard to decide that which algorithm is beneficial in case of highly complex ne...
متن کاملOn the Spectrum of the Derangement Graph
We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.
متن کاملCharacterizations of the simple group $D_{n}(3)$ by prime graph and spectrum
We prove that $D_n(3)$, where $ngeq6$ is even, is uniquely determined by its prime graph. Also, if $G$ is a finite group with the same prime graph as $D_4(3)$, then $Gcong D_4(3), B_3(3), C_3(3)$ or $G/O_2(G)cong {rm Aut}({}^2B_2(8))$.
متن کاملNonbacktracking Bounds on the Influence in Independent Cascade Models
This paper develops upper and lower bounds on the influence measure in a network, more precisely, the expected number of nodes that a seed set can influence in the independent cascade model. In particular, our bounds exploit nonbacktracking walks, Fortuin–Kasteleyn–Ginibre (FKG) type inequalities, and are computed by message passing implementation. Nonbacktracking walks have recently allowed fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.99.052309